A rank-adaptive robust integrator for dynamical low-rank approximation
نویسندگان
چکیده
A rank-adaptive integrator for the dynamical low-rank approximation of matrix and tensor differential equations is presented. The fixed-rank recently proposed by two authors extended to allow an adaptive choice rank, using subspaces that are generated itself. first updates evolving bases then does a Galerkin step in subspace both new old bases, which followed rank truncation given tolerance. It shown retains exactness, robustness symmetry-preserving properties previously integrator. Beyond that, up tolerance, preserves norm when equation does, it energy Schrödinger Hamiltonian systems, monotonic decrease functional gradient flows. Numerical experiments illustrate behaviour
منابع مشابه
Dynamical low-rank approximation
In low-rank approximation, separation of variables is used to reduce the amount of data in computations with high-dimensional functions. Such techniques have proved their value, e.g., in quantum mechanics and recommendation algorithms. It is also possible to fold a low-dimensional grid into a high-dimensional object, and use low-rank techniques to compress the data. Here, we consider low-rank t...
متن کاملDynamical Low-Rank Approximation
For the low rank approximation of time-dependent data matrices and of solutions to matrix differential equations, an increment-based computational approach is proposed and analyzed. In this method, the derivative is projected onto the tangent space of the manifold of rank-r matrices at the current approximation. With an appropriate decomposition of rank-r matrices and their tangent matrices, th...
متن کاملRobust Weighted Low-Rank Matrix Approximation
The calculation of a low-rank approximation to a matrix is fundamental to many algorithms in computer vision and other fields. One of the primary tools used for calculating such low-rank approximations is the Singular Value Decomposition, but this method is not applicable in the case where there are outliers or missing elements in the data. Unfortunately this is often the case in practice. We p...
متن کاملLow-rank Tensor Approximation
Approximating a tensor by another of lower rank is in general an ill posed problem. Yet, this kind of approximation is mandatory in the presence of measurement errors or noise. We show how tools recently developed in compressed sensing can be used to solve this problem. More precisely, a minimal angle between the columns of loading matrices allows to restore both existence and uniqueness of the...
متن کاملStructured Low Rank Approximation
Abstract. This paper concerns the construction of a structured low rank matrix that is nearest to a given matrix. The notion of structured low rank approximation arises in various applications, ranging from signal enhancement to protein folding to computer algebra, where the empirical data collected in a matrix do not maintain either the specified structure or the desirable rank as is expected ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bit Numerical Mathematics
سال: 2022
ISSN: ['0006-3835', '1572-9125']
DOI: https://doi.org/10.1007/s10543-021-00907-7